On diagonally preconditioning the truncated Newton method for super-scale linearly constrained nonlinear programming
نویسندگان
چکیده
منابع مشابه
A Truncated Newton Algorithm for Large Scale Box Constrained Optimization
A new method for the solution of minimization problems with simple bounds is presented. Global convergence of a general scheme requiring the approximate solution of a single linear system at each iteration is proved and a superlinear convergence rate is established without requiring the strict complementarity assumption. The algorithm proposed is based on a simple, smooth unconstrained reformul...
متن کاملA truncated Newton method in an augmented Lagrangian framework for nonlinear programming
In this paper we propose a primal-dual algorithm for the solution of general nonlinear programming problems. The core of the method is a local algorithm which relies on a truncated procedure for the computation of a search direction, thus resulting suitable for large scale problems. The truncated direction produces a sequence of points which locally converges to a KKT pair with superlinear conv...
متن کاملA Globally Convergent Linearly Constrained Lagrangian Method for Nonlinear Optimization
For optimization problems with nonlinear constraints, linearly constrained Lagrangian (LCL) methods sequentially minimize a Lagrangian function subject to linearized constraints. These methods converge rapidly near a solution but may not be reliable from arbitrary starting points. The well known example MINOS has proven effective on many large problems. Its success motivates us to propose a glo...
متن کاملA Truncated Sqp Algorithm for Large Scale Nonlinear Programming Problems
We consider the inequality constrained nonlinear programming problem and an SQP algorithm for its solution. We are primarily concerned with two aspects of the general procedure, namely, the approximate solution of the quadratic program, and the need for an appropriate merit function. We rst describe an (iterative) interior-point method for the quadratic programming subproblem that, no matter wh...
متن کاملAn Active Set-type Newton Method for Constrained Nonlinear Systems
We consider the problem of nding a solution of a nonlinear system of equations subject to some box constraints. To this end, we introduce a new active set-type Newton method with global and local fast convergence properties. The method generates feasible iterates and has to solve only one linear system of equations at each iteration. Due to our active set strategy, this linear system is of redu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 1984
ISSN: 0377-2217
DOI: 10.1016/0377-2217(84)90136-x